#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;

const int N = 210, INF = 0x3f3f3f3f;

int n;
int a[N], sum[N];
int f[N][N], g[N][N];

void solve()
{
    cin >> n;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];a[i + n] = a[i];
    }
    for (int i = 1;i <= 2 * n;i++) sum[i] = sum[i - 1] + a[i];

    memset(f, INF, sizeof f);
    for (int i = 1;i <= 2 * n;i++) f[i][i] = 0;

    for (int len = 2;len <= n;len++)
        for (int i = 1;i + len - 1 <= 2 * n;i++) {
            int j = i + len - 1;
            for (int k = i;k < j;k++) {
                f[i][j] = min(f[i][j], f[i][k] + f[k + 1][j] + sum[j] - sum[i - 1]);
                g[i][j] = max(g[i][j], g[i][k] + g[k + 1][j] + sum[j] - sum[i - 1]);
            }
        }
    int mi = INF, mx = 0;
    for (int i = 1;i <= n;i++) {
        mi = min(mi, f[i][i + n - 1]);
        mx = max(mx, g[i][i + n - 1]);
    }
    cout << mi << '\n' << mx << '\n';
}

signed main()
{
    //ios::sync_with_stdio(0);
    //cin.tie(0);cout.tie(0);
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    std::istringstream in(R"()");
    std::cin.rdbuf(in.rdbuf());
#endif
    int T = 1;
    //cin>>T;
    for (int i = 1;i <= T;i++) {
        solve();
    }
}